Moments of Markovian growth–collapse processes
نویسندگان
چکیده
Abstract We apply general moment identities for Poisson stochastic integrals with random integrands to the computation of moments Markovian growth–collapse processes. This extends existing formulas mean and variance available in literature closed-form expressions all orders. In comparison other methods based on differential equations, our approach yields explicit summations terms time parameter. also treat case associated embedded chain, provide recursive codes Maple Mathematica cumulants any order arbitrary cut-off sequences jump size functions.
منابع مشابه
Markovian Processes Go Algebra
We propose a calculus MPA for reasoning about random behaviour through time. In contrast to classical calculi each atomic action is supposed to happen after a delay that is characterized by a certain exponentially distributed random variable. The operational semantics of the calculus deenes markovian labelled transition systems as a combination of classical action-oriented transition systems an...
متن کاملFactorial moments of point processes
We derive joint factorial moment identities for point processes with Papangelou intensities. Our proof simplifies previous combinatorical approaches to the computation of moments for point processes. We also obtain new explicit sufficient conditions for the distributional invariance of point processes with Papangelou intensities under random transformations.
متن کاملValues for Markovian Coalition Processes
Time series of coalitions (so-called scenarios) are studied that describe processes of coalition formation where several players may enter or leave the current coalition at any point in (discrete) time and convergence to the grand coalition is not necessarily prescribed. Transitions from one coalition to the next are assumed to be random and to yield a Markov chain. Three examples of such proce...
متن کاملSimulating non-Markovian stochastic processes.
We present a simple and general framework to simulate statistically correct realizations of a system of non-Markovian discrete stochastic processes. We give the exact analytical solution and a practical and efficient algorithm like the Gillespie algorithm for Markovian processes, with the difference being that now the occurrence rates of the events depend on the time elapsed since the event las...
متن کاملBatch Markovian Arrival Processes (BMAP)
This article describes the batch Markovian arrival process (BMAP), a point process that is characterized by Markov-modulated batch arrivals of random size. The BMAP is a generalization of many well-known processes including the Markovian arrival process (MAP), the Poisson process, and the Markov-modulated Poisson process. It provides a common framework for modeling arrival processes in a variet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2022
ISSN: ['1475-6064', '0001-8678']
DOI: https://doi.org/10.1017/apr.2021.63